
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">


<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
    
    <title>1. Kaleidoscope: Tutorial Introduction and the Lexer &mdash; LLVM 3.7 documentation</title>
    
    <link rel="stylesheet" href="../_static/llvm-theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/pygments.css" type="text/css" />
    
    <script type="text/javascript">
      var DOCUMENTATION_OPTIONS = {
        URL_ROOT:    '../',
        VERSION:     '3.7',
        COLLAPSE_INDEX: false,
        FILE_SUFFIX: '.html',
        HAS_SOURCE:  true
      };
    </script>
    <script type="text/javascript" src="../_static/jquery.js"></script>
    <script type="text/javascript" src="../_static/underscore.js"></script>
    <script type="text/javascript" src="../_static/doctools.js"></script>
    <link rel="top" title="LLVM 3.7 documentation" href="../index.html" />
    <link rel="up" title="LLVM Tutorial: Table of Contents" href="index.html" />
    <link rel="next" title="2. Kaleidoscope: Implementing a Parser and AST" href="OCamlLangImpl2.html" />
    <link rel="prev" title="9. Kaleidoscope: Conclusion and other useful LLVM tidbits" href="LangImpl9.html" />
<style type="text/css">
  table.right { float: right; margin-left: 20px; }
  table.right td { border: 1px solid #ccc; }
</style>

  </head>
  <body role="document">
<div class="logo">
  <a href="../index.html">
    <img src="../_static/logo.png"
         alt="LLVM Logo" width="250" height="88"/></a>
</div>

    <div class="related" role="navigation" aria-label="related navigation">
      <h3>Navigation</h3>
      <ul>
        <li class="right" style="margin-right: 10px">
          <a href="../genindex.html" title="General Index"
             accesskey="I">index</a></li>
        <li class="right" >
          <a href="OCamlLangImpl2.html" title="2. Kaleidoscope: Implementing a Parser and AST"
             accesskey="N">next</a> |</li>
        <li class="right" >
          <a href="LangImpl9.html" title="9. Kaleidoscope: Conclusion and other useful LLVM tidbits"
             accesskey="P">previous</a> |</li>
  <li><a href="http://llvm.org/">LLVM Home</a>&nbsp;|&nbsp;</li>
  <li><a href="../index.html">Documentation</a>&raquo;</li>

          <li class="nav-item nav-item-1"><a href="index.html" accesskey="U">LLVM Tutorial: Table of Contents</a> &raquo;</li> 
      </ul>
    </div>


    <div class="document">
      <div class="documentwrapper">
          <div class="body" role="main">
            
  <div class="section" id="kaleidoscope-tutorial-introduction-and-the-lexer">
<h1>1. Kaleidoscope: Tutorial Introduction and the Lexer<a class="headerlink" href="#kaleidoscope-tutorial-introduction-and-the-lexer" title="Permalink to this headline">¶</a></h1>
<div class="contents local topic" id="contents">
<ul class="simple">
<li><a class="reference internal" href="#tutorial-introduction" id="id1">Tutorial Introduction</a></li>
<li><a class="reference internal" href="#the-basic-language" id="id2">The Basic Language</a></li>
<li><a class="reference internal" href="#the-lexer" id="id3">The Lexer</a></li>
</ul>
</div>
<div class="section" id="tutorial-introduction">
<h2><a class="toc-backref" href="#id1">1.1. Tutorial Introduction</a><a class="headerlink" href="#tutorial-introduction" title="Permalink to this headline">¶</a></h2>
<p>Welcome to the &#8220;Implementing a language with LLVM&#8221; tutorial. This
tutorial runs through the implementation of a simple language, showing
how fun and easy it can be. This tutorial will get you up and started as
well as help to build a framework you can extend to other languages. The
code in this tutorial can also be used as a playground to hack on other
LLVM specific things.</p>
<p>The goal of this tutorial is to progressively unveil our language,
describing how it is built up over time. This will let us cover a fairly
broad range of language design and LLVM-specific usage issues, showing
and explaining the code for it all along the way, without overwhelming
you with tons of details up front.</p>
<p>It is useful to point out ahead of time that this tutorial is really
about teaching compiler techniques and LLVM specifically, <em>not</em> about
teaching modern and sane software engineering principles. In practice,
this means that we&#8217;ll take a number of shortcuts to simplify the
exposition. For example, the code leaks memory, uses global variables
all over the place, doesn&#8217;t use nice design patterns like
<a class="reference external" href="http://en.wikipedia.org/wiki/Visitor_pattern">visitors</a>, etc... but
it is very simple. If you dig in and use the code as a basis for future
projects, fixing these deficiencies shouldn&#8217;t be hard.</p>
<p>I&#8217;ve tried to put this tutorial together in a way that makes chapters
easy to skip over if you are already familiar with or are uninterested
in the various pieces. The structure of the tutorial is:</p>
<ul class="simple">
<li><a class="reference external" href="#language">Chapter #1</a>: Introduction to the Kaleidoscope
language, and the definition of its Lexer - This shows where we are
going and the basic functionality that we want it to do. In order to
make this tutorial maximally understandable and hackable, we choose
to implement everything in Objective Caml instead of using lexer and
parser generators. LLVM obviously works just fine with such tools,
feel free to use one if you prefer.</li>
<li><a class="reference external" href="OCamlLangImpl2.html">Chapter #2</a>: Implementing a Parser and
AST - With the lexer in place, we can talk about parsing techniques
and basic AST construction. This tutorial describes recursive descent
parsing and operator precedence parsing. Nothing in Chapters 1 or 2
is LLVM-specific, the code doesn&#8217;t even link in LLVM at this point.
:)</li>
<li><a class="reference external" href="OCamlLangImpl3.html">Chapter #3</a>: Code generation to LLVM IR -
With the AST ready, we can show off how easy generation of LLVM IR
really is.</li>
<li><a class="reference external" href="OCamlLangImpl4.html">Chapter #4</a>: Adding JIT and Optimizer
Support - Because a lot of people are interested in using LLVM as a
JIT, we&#8217;ll dive right into it and show you the 3 lines it takes to
add JIT support. LLVM is also useful in many other ways, but this is
one simple and &#8220;sexy&#8221; way to shows off its power. :)</li>
<li><a class="reference external" href="OCamlLangImpl5.html">Chapter #5</a>: Extending the Language:
Control Flow - With the language up and running, we show how to
extend it with control flow operations (if/then/else and a &#8216;for&#8217;
loop). This gives us a chance to talk about simple SSA construction
and control flow.</li>
<li><a class="reference external" href="OCamlLangImpl6.html">Chapter #6</a>: Extending the Language:
User-defined Operators - This is a silly but fun chapter that talks
about extending the language to let the user program define their own
arbitrary unary and binary operators (with assignable precedence!).
This lets us build a significant piece of the &#8220;language&#8221; as library
routines.</li>
<li><a class="reference external" href="OCamlLangImpl7.html">Chapter #7</a>: Extending the Language:
Mutable Variables - This chapter talks about adding user-defined
local variables along with an assignment operator. The interesting
part about this is how easy and trivial it is to construct SSA form
in LLVM: no, LLVM does <em>not</em> require your front-end to construct SSA
form!</li>
<li><a class="reference external" href="OCamlLangImpl8.html">Chapter #8</a>: Conclusion and other useful
LLVM tidbits - This chapter wraps up the series by talking about
potential ways to extend the language, but also includes a bunch of
pointers to info about &#8220;special topics&#8221; like adding garbage
collection support, exceptions, debugging, support for &#8220;spaghetti
stacks&#8221;, and a bunch of other tips and tricks.</li>
</ul>
<p>By the end of the tutorial, we&#8217;ll have written a bit less than 700 lines
of non-comment, non-blank, lines of code. With this small amount of
code, we&#8217;ll have built up a very reasonable compiler for a non-trivial
language including a hand-written lexer, parser, AST, as well as code
generation support with a JIT compiler. While other systems may have
interesting &#8220;hello world&#8221; tutorials, I think the breadth of this
tutorial is a great testament to the strengths of LLVM and why you
should consider it if you&#8217;re interested in language or compiler design.</p>
<p>A note about this tutorial: we expect you to extend the language and
play with it on your own. Take the code and go crazy hacking away at it,
compilers don&#8217;t need to be scary creatures - it can be a lot of fun to
play with languages!</p>
</div>
<div class="section" id="the-basic-language">
<h2><a class="toc-backref" href="#id2">1.2. The Basic Language</a><a class="headerlink" href="#the-basic-language" title="Permalink to this headline">¶</a></h2>
<p>This tutorial will be illustrated with a toy language that we&#8217;ll call
&#8220;<a class="reference external" href="http://en.wikipedia.org/wiki/Kaleidoscope">Kaleidoscope</a>&#8221; (derived
from &#8220;meaning beautiful, form, and view&#8221;). Kaleidoscope is a procedural
language that allows you to define functions, use conditionals, math,
etc. Over the course of the tutorial, we&#8217;ll extend Kaleidoscope to
support the if/then/else construct, a for loop, user defined operators,
JIT compilation with a simple command line interface, etc.</p>
<p>Because we want to keep things simple, the only datatype in Kaleidoscope
is a 64-bit floating point type (aka &#8216;float&#8217; in O&#8217;Caml parlance). As
such, all values are implicitly double precision and the language
doesn&#8217;t require type declarations. This gives the language a very nice
and simple syntax. For example, the following simple example computes
<a class="reference external" href="http://en.wikipedia.org/wiki/Fibonacci_number">Fibonacci numbers:</a></p>
<div class="highlight-python"><div class="highlight"><pre># Compute the x&#39;th fibonacci number.
def fib(x)
  if x &lt; 3 then
    1
  else
    fib(x-1)+fib(x-2)

# This expression will compute the 40th number.
fib(40)
</pre></div>
</div>
<p>We also allow Kaleidoscope to call into standard library functions (the
LLVM JIT makes this completely trivial). This means that you can use the
&#8216;extern&#8217; keyword to define a function before you use it (this is also
useful for mutually recursive functions). For example:</p>
<div class="highlight-python"><div class="highlight"><pre>extern sin(arg);
extern cos(arg);
extern atan2(arg1 arg2);

atan2(sin(.4), cos(42))
</pre></div>
</div>
<p>A more interesting example is included in Chapter 6 where we write a
little Kaleidoscope application that <a class="reference external" href="OCamlLangImpl6.html#example">displays a Mandelbrot
Set</a> at various levels of magnification.</p>
<p>Lets dive into the implementation of this language!</p>
</div>
<div class="section" id="the-lexer">
<h2><a class="toc-backref" href="#id3">1.3. The Lexer</a><a class="headerlink" href="#the-lexer" title="Permalink to this headline">¶</a></h2>
<p>When it comes to implementing a language, the first thing needed is the
ability to process a text file and recognize what it says. The
traditional way to do this is to use a
&#8220;<a class="reference external" href="http://en.wikipedia.org/wiki/Lexical_analysis">lexer</a>&#8221; (aka
&#8216;scanner&#8217;) to break the input up into &#8220;tokens&#8221;. Each token returned by
the lexer includes a token code and potentially some metadata (e.g. the
numeric value of a number). First, we define the possibilities:</p>
<div class="highlight-ocaml"><div class="highlight"><pre><span class="c">(* The lexer returns these &#39;Kwd&#39; if it is an unknown character, otherwise one of</span>
<span class="c"> * these others for known things. *)</span>
<span class="k">type</span> <span class="n">token</span> <span class="o">=</span>
  <span class="c">(* commands *)</span>
  <span class="o">|</span> <span class="nc">Def</span> <span class="o">|</span> <span class="nc">Extern</span>

  <span class="c">(* primary *)</span>
  <span class="o">|</span> <span class="nc">Ident</span> <span class="k">of</span> <span class="kt">string</span> <span class="o">|</span> <span class="nc">Number</span> <span class="k">of</span> <span class="kt">float</span>

  <span class="c">(* unknown *)</span>
  <span class="o">|</span> <span class="nc">Kwd</span> <span class="k">of</span> <span class="kt">char</span>
</pre></div>
</div>
<p>Each token returned by our lexer will be one of the token variant
values. An unknown character like &#8216;+&#8217; will be returned as
<code class="docutils literal"><span class="pre">Token.Kwd</span> <span class="pre">'+'</span></code>. If the curr token is an identifier, the value will be
<code class="docutils literal"><span class="pre">Token.Ident</span> <span class="pre">s</span></code>. If the current token is a numeric literal (like 1.0),
the value will be <code class="docutils literal"><span class="pre">Token.Number</span> <span class="pre">1.0</span></code>.</p>
<p>The actual implementation of the lexer is a collection of functions
driven by a function named <code class="docutils literal"><span class="pre">Lexer.lex</span></code>. The <code class="docutils literal"><span class="pre">Lexer.lex</span></code> function is
called to return the next token from standard input. We will use
<a class="reference external" href="http://caml.inria.fr/pub/docs/manual-camlp4/index.html">Camlp4</a> to
simplify the tokenization of the standard input. Its definition starts
as:</p>
<div class="highlight-ocaml"><div class="highlight"><pre><span class="c">(*===----------------------------------------------------------------------===</span>
<span class="c"> * Lexer</span>
<span class="c"> *===----------------------------------------------------------------------===*)</span>

<span class="k">let</span> <span class="k">rec</span> <span class="n">lex</span> <span class="o">=</span> <span class="n">parser</span>
  <span class="c">(* Skip any whitespace. *)</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span> <span class="o">(</span><span class="sc">&#39; &#39;</span> <span class="o">|</span> <span class="sc">&#39;\n&#39;</span> <span class="o">|</span> <span class="sc">&#39;\r&#39;</span> <span class="o">|</span> <span class="sc">&#39;\t&#39;</span><span class="o">);</span> <span class="n">stream</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span> <span class="n">lex</span> <span class="n">stream</span>
</pre></div>
</div>
<p><code class="docutils literal"><span class="pre">Lexer.lex</span></code> works by recursing over a <code class="docutils literal"><span class="pre">char</span> <span class="pre">Stream.t</span></code> to read
characters one at a time from the standard input. It eats them as it
recognizes them and stores them in in a <code class="docutils literal"><span class="pre">Token.token</span></code> variant. The
first thing that it has to do is ignore whitespace between tokens. This
is accomplished with the recursive call above.</p>
<p>The next thing <code class="docutils literal"><span class="pre">Lexer.lex</span></code> needs to do is recognize identifiers and
specific keywords like &#8220;def&#8221;. Kaleidoscope does this with a pattern
match and a helper function.</p>
<div class="highlight-ocaml"><div class="highlight"><pre>  <span class="c">(* identifier: [a-zA-Z][a-zA-Z0-9] *)</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span> <span class="o">(</span><span class="sc">&#39;A&#39;</span> <span class="o">..</span> <span class="sc">&#39;Z&#39;</span> <span class="o">|</span> <span class="sc">&#39;a&#39;</span> <span class="o">..</span> <span class="sc">&#39;z&#39;</span> <span class="k">as</span> <span class="n">c</span><span class="o">);</span> <span class="n">stream</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
      <span class="k">let</span> <span class="n">buffer</span> <span class="o">=</span> <span class="nn">Buffer</span><span class="p">.</span><span class="n">create</span> <span class="mi">1</span> <span class="k">in</span>
      <span class="nn">Buffer</span><span class="p">.</span><span class="n">add_char</span> <span class="n">buffer</span> <span class="n">c</span><span class="o">;</span>
      <span class="n">lex_ident</span> <span class="n">buffer</span> <span class="n">stream</span>

<span class="o">...</span>

<span class="ow">and</span> <span class="n">lex_ident</span> <span class="n">buffer</span> <span class="o">=</span> <span class="n">parser</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span> <span class="o">(</span><span class="sc">&#39;A&#39;</span> <span class="o">..</span> <span class="sc">&#39;Z&#39;</span> <span class="o">|</span> <span class="sc">&#39;a&#39;</span> <span class="o">..</span> <span class="sc">&#39;z&#39;</span> <span class="o">|</span> <span class="sc">&#39;0&#39;</span> <span class="o">..</span> <span class="sc">&#39;9&#39;</span> <span class="k">as</span> <span class="n">c</span><span class="o">);</span> <span class="n">stream</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
      <span class="nn">Buffer</span><span class="p">.</span><span class="n">add_char</span> <span class="n">buffer</span> <span class="n">c</span><span class="o">;</span>
      <span class="n">lex_ident</span> <span class="n">buffer</span> <span class="n">stream</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="n">stream</span><span class="o">=</span><span class="n">lex</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
      <span class="k">match</span> <span class="nn">Buffer</span><span class="p">.</span><span class="n">contents</span> <span class="n">buffer</span> <span class="k">with</span>
      <span class="o">|</span> <span class="s2">&quot;def&quot;</span> <span class="o">-&gt;</span> <span class="o">[&lt;</span> <span class="k">&#39;</span><span class="nn">Token</span><span class="p">.</span><span class="nc">Def</span><span class="o">;</span> <span class="n">stream</span> <span class="o">&gt;]</span>
      <span class="o">|</span> <span class="s2">&quot;extern&quot;</span> <span class="o">-&gt;</span> <span class="o">[&lt;</span> <span class="k">&#39;</span><span class="nn">Token</span><span class="p">.</span><span class="nc">Extern</span><span class="o">;</span> <span class="n">stream</span> <span class="o">&gt;]</span>
      <span class="o">|</span> <span class="n">id</span> <span class="o">-&gt;</span> <span class="o">[&lt;</span> <span class="k">&#39;</span><span class="nn">Token</span><span class="p">.</span><span class="nc">Ident</span> <span class="n">id</span><span class="o">;</span> <span class="n">stream</span> <span class="o">&gt;]</span>
</pre></div>
</div>
<p>Numeric values are similar:</p>
<div class="highlight-ocaml"><div class="highlight"><pre>  <span class="c">(* number: [0-9.]+ *)</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span> <span class="o">(</span><span class="sc">&#39;0&#39;</span> <span class="o">..</span> <span class="sc">&#39;9&#39;</span> <span class="k">as</span> <span class="n">c</span><span class="o">);</span> <span class="n">stream</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
      <span class="k">let</span> <span class="n">buffer</span> <span class="o">=</span> <span class="nn">Buffer</span><span class="p">.</span><span class="n">create</span> <span class="mi">1</span> <span class="k">in</span>
      <span class="nn">Buffer</span><span class="p">.</span><span class="n">add_char</span> <span class="n">buffer</span> <span class="n">c</span><span class="o">;</span>
      <span class="n">lex_number</span> <span class="n">buffer</span> <span class="n">stream</span>

<span class="o">...</span>

<span class="ow">and</span> <span class="n">lex_number</span> <span class="n">buffer</span> <span class="o">=</span> <span class="n">parser</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span> <span class="o">(</span><span class="sc">&#39;0&#39;</span> <span class="o">..</span> <span class="sc">&#39;9&#39;</span> <span class="o">|</span> <span class="sc">&#39;.&#39;</span> <span class="k">as</span> <span class="n">c</span><span class="o">);</span> <span class="n">stream</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
      <span class="nn">Buffer</span><span class="p">.</span><span class="n">add_char</span> <span class="n">buffer</span> <span class="n">c</span><span class="o">;</span>
      <span class="n">lex_number</span> <span class="n">buffer</span> <span class="n">stream</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="n">stream</span><span class="o">=</span><span class="n">lex</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
      <span class="o">[&lt;</span> <span class="k">&#39;</span><span class="nn">Token</span><span class="p">.</span><span class="nc">Number</span> <span class="o">(</span><span class="n">float_of_string</span> <span class="o">(</span><span class="nn">Buffer</span><span class="p">.</span><span class="n">contents</span> <span class="n">buffer</span><span class="o">));</span> <span class="n">stream</span> <span class="o">&gt;]</span>
</pre></div>
</div>
<p>This is all pretty straight-forward code for processing input. When
reading a numeric value from input, we use the ocaml <code class="docutils literal"><span class="pre">float_of_string</span></code>
function to convert it to a numeric value that we store in
<code class="docutils literal"><span class="pre">Token.Number</span></code>. Note that this isn&#8217;t doing sufficient error checking:
it will raise <code class="docutils literal"><span class="pre">Failure</span></code> if the string &#8220;1.23.45.67&#8221;. Feel free to
extend it :). Next we handle comments:</p>
<div class="highlight-ocaml"><div class="highlight"><pre>  <span class="c">(* Comment until end of line. *)</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span> <span class="o">(</span><span class="sc">&#39;#&#39;</span><span class="o">);</span> <span class="n">stream</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
      <span class="n">lex_comment</span> <span class="n">stream</span>

<span class="o">...</span>

<span class="ow">and</span> <span class="n">lex_comment</span> <span class="o">=</span> <span class="n">parser</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span> <span class="o">(</span><span class="sc">&#39;\n&#39;</span><span class="o">);</span> <span class="n">stream</span><span class="o">=</span><span class="n">lex</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span> <span class="n">stream</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span><span class="n">c</span><span class="o">;</span> <span class="n">e</span><span class="o">=</span><span class="n">lex_comment</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span> <span class="n">e</span>
  <span class="o">|</span> <span class="o">[&lt;</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span> <span class="o">[&lt;</span> <span class="o">&gt;]</span>
</pre></div>
</div>
<p>We handle comments by skipping to the end of the line and then return
the next token. Finally, if the input doesn&#8217;t match one of the above
cases, it is either an operator character like &#8216;+&#8217; or the end of the
file. These are handled with this code:</p>
<div class="highlight-ocaml"><div class="highlight"><pre><span class="c">(* Otherwise, just return the character as its ascii value. *)</span>
<span class="o">|</span> <span class="o">[&lt;</span> <span class="k">&#39;</span><span class="n">c</span><span class="o">;</span> <span class="n">stream</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span>
    <span class="o">[&lt;</span> <span class="k">&#39;</span><span class="nn">Token</span><span class="p">.</span><span class="nc">Kwd</span> <span class="n">c</span><span class="o">;</span> <span class="n">lex</span> <span class="n">stream</span> <span class="o">&gt;]</span>

<span class="c">(* end of stream. *)</span>
<span class="o">|</span> <span class="o">[&lt;</span> <span class="o">&gt;]</span> <span class="o">-&gt;</span> <span class="o">[&lt;</span> <span class="o">&gt;]</span>
</pre></div>
</div>
<p>With this, we have the complete lexer for the basic Kaleidoscope
language (the <a class="reference external" href="OCamlLangImpl2.html#code">full code listing</a> for the
Lexer is available in the <a class="reference external" href="OCamlLangImpl2.html">next chapter</a> of the
tutorial). Next we&#8217;ll <a class="reference external" href="OCamlLangImpl2.html">build a simple parser that uses this to build an
Abstract Syntax Tree</a>. When we have that, we&#8217;ll
include a driver so that you can use the lexer and parser together.</p>
<p><a class="reference external" href="OCamlLangImpl2.html">Next: Implementing a Parser and AST</a></p>
</div>
</div>


          </div>
      </div>
      <div class="clearer"></div>
    </div>
    <div class="related" role="navigation" aria-label="related navigation">
      <h3>Navigation</h3>
      <ul>
        <li class="right" style="margin-right: 10px">
          <a href="../genindex.html" title="General Index"
             >index</a></li>
        <li class="right" >
          <a href="OCamlLangImpl2.html" title="2. Kaleidoscope: Implementing a Parser and AST"
             >next</a> |</li>
        <li class="right" >
          <a href="LangImpl9.html" title="9. Kaleidoscope: Conclusion and other useful LLVM tidbits"
             >previous</a> |</li>
  <li><a href="http://llvm.org/">LLVM Home</a>&nbsp;|&nbsp;</li>
  <li><a href="../index.html">Documentation</a>&raquo;</li>

          <li class="nav-item nav-item-1"><a href="index.html" >LLVM Tutorial: Table of Contents</a> &raquo;</li> 
      </ul>
    </div>
    <div class="footer" role="contentinfo">
        &copy; Copyright 2003-2015, LLVM Project.
      Last updated on 2015-09-08.
      Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.3.1.
    </div>
  </body>
</html>